Перевод: со всех языков на все языки

со всех языков на все языки

Sheffer stroke gate

См. также в других словарях:

  • Sheffer stroke — This article is about the logical NAND operator. For the electronic NAND gate, see Negated AND gate. For other uses, see Nand (disambiguation). Venn diagram of In Boolean functions and propositional calculus, the Sheffer stroke, named after …   Wikipedia

  • Logic gate — A logic gate is an idealized or physical device implementing a Boolean function, that is, it performs a logical operation on one or more logic inputs and produces a single logic output. Depending on the context, the term may refer to an ideal… …   Wikipedia

  • Negated AND gate — This article is about NAND in the sense of an electronic logic gate. For NAND in the purely logical sense, see Sheffer stroke. For other uses of NAND or Nand, see Nand (disambiguation). INPUT A   B OUTPUT A NAND B 0 0 1 0 1 1 1 0 …   Wikipedia

  • Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… …   Wikipedia

  • Logical NOR — This article is about NOR in the logical sense. For the electronic gate, see NOR gate. For other uses, see Nor. Venn diagram of In boolean logic, logical nor or joint denial is a truth functional operator which produces a result that is the… …   Wikipedia

  • List of Boolean algebra topics — This is a list of topics around Boolean algebra and propositional logic. Contents 1 Articles with a wide scope and introductions 2 Boolean functions and connectives 3 Examples of Boolean algebras …   Wikipedia

  • Sufficiently connected — In propositional logic, a set of Boolean operators is called sufficient if it permits the realisation of any possible truth table.Example truth table (Xor):Using a complete Boolean algebra which does not include XOR (such as the well known AND OR …   Wikipedia

  • Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… …   Wikipedia

  • Outline of logic — The following outline is provided as an overview of and topical guide to logic: Logic – formal science of using reason, considered a branch of both philosophy and mathematics. Logic investigates and classifies the structure of statements and… …   Wikipedia

  • Varèse Sarabande — Infobox record label name = Varèse Sarabande image bg = parent = founded =1978 founder =Tom Null, Chris Kuchler and Scot W. Holton status = distributor =Universal Music Group Fontana Distribution genre = film scores and original cast recordings… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»